An Improved Node Partitioning Algorithm for the CMST Problem
نویسندگان
چکیده
The capacitated minimum spanning tree (CMST) problem is one of the most fundamental and significant problems in the optimal design of communication networks. In this paper several methods are proposed to improve existing node-oriented branch and bound algorithm for the CMST problem. Techniques for acquiring tighter lower bound are emphasized, while regulations for faster traversing of the search tree are proposed on the basis of comprehensive observation of the search procedure. Computational experiences demonstrate that the proposed methods significantly improved the efficiency of the existing algorithms. Moreover, as an exact algorithm, the proposed one is the first algorithm that solved the 41 node te-class benchmark problem instances.
منابع مشابه
Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem
This study deals with the Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) problem arising in topology discovery of local network. While the traditional Capacitated Minimum Spanning Tree (CMST) problem deals with only traffic capacity constraint of a port of a source node, and Delay-Constrained Minimum Spanning Tree (DCMST) considers only the maximum end-to-end delay constraint, th...
متن کاملDesign and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملDynamic Capacitated Minimum Spanning Trees
Given a set of terminals, each associated with a positive number denoting the traffic to be routed to a central terminal (root), the Capacitated Minimum Spanning Tree (CMST) problem asks for a minimum spanning tree, spanning all terminals, such that the amount of traffic routed from a subtree, linked to the root by an edge, does not exceed the given capacity constraint . The CMST problem is NP-...
متن کاملENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملExact algorithm for delay-constrained capacitated minimum spanning tree network
The delay-constrained capacitated minimum spanning tree (DC-CMST) problem of finding several broadcast trees from a source node is discussed. While the traditional CMST problem deals with only the traffic capacity constraint served by a port of the source node, and delay-constrained minimum spanning tree (DCMST) considers only the maximum end–end delay constraint, the DC-CMST problem deals with...
متن کامل